A GRASP with path-relinking for private virtual circuit routing
نویسندگان
چکیده
A frame relay service offers virtual private networks to customers by provisioning a set of long-term private virtual circuits (PVCs) between customer endpoints on a large backbone network. During the provisioning of a PVC, routing decisions are made without any knowledge of future requests. Over time, these decisions can cause inefficiencies in the network and occasional offline rerouting of the PVCs is needed. In this paper, the offline PVC routing problem is formulated as an integer multicommodity flow problem with additional constraints and with an objective function that minimizes propagation delays and/or network congestion. We propose variants of a GRASP with path-relinking heuristic for this problem. Experimental results for realistic-size problems are reported, showing that the proposed heuristics are able to improve the solutions found with standard routing techniques. Moreover, the structure of our objective function provides a useful strategy for setting the appropriate value of its weight parameter, to achieve some quality of service (QoS) level defined by a desired balance between propagation delay and delay due to network congestion.
منابع مشابه
A Grasp with Path-relinking for Permanent Virtual Circuit Routing
A frame relay service offers virtual private networks to customers by provisioning a set of long-term private virtual circuits (PVCs) between customer endpoints on a large backbone network. During the provisioning of a PVC, routing decisions are made without any knowledge of future requests. Over time, these decisions can cause inefficiencies in the network and occasional offline rerouting of t...
متن کاملRestart strategies for GRASP with path-relinking heuristics
GRASP with path-relinking is a hybrid metaheuristic, or stochastic local search (Monte Carlo) method, for combinatorial optimization. A restart strategy in GRASP with path-relinking heuristics is a set of iterations {i1, i2, . . .} on which the heuristic is restarted from scratch using a new seed for the random number generator. Restart strategies have been shown to speed up stochastic local se...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملGRASP with Path Relinking for the Two-Echelon Vehicle Routing Problem
We propose a meta-heuristic based on GRASP combined with Path Relinking to address the Two-Echelon Vehicle Routing Problem, an extension of the Capacitated Vehicle Routing Problem in which the delivery from a single depot to customers is achieved by routing and consolidating the freight through intermediate depots called satellites. The problem is treated by separating the depot-to-satellite tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Networks
دوره 41 شماره
صفحات -
تاریخ انتشار 2003